Flexible flow shop scheduling problem to minimize makespan with renewable resources
نویسندگان
چکیده
منابع مشابه
Scheduling integrated flexible job - shop problem with preventive maintenance to minimize makespan and system unavailability
Integrating flexible job-shop scheduling problem (FJSP) with preventive maintenance (PM) is pondered in this paper. Minimizing the makespan for scheduling part and minimizing the system unavailability for maintenance part are simultaneously under consideration. For doing it, the assignment of n jobs on m machines in production side and executing the PM actions at appropriate time intervals in m...
متن کاملA hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem
This paper deals with the permutation flow shop scheduling problem. The objective is to minimize the maximum completion time, or makespan. To solve this problem which has been proved to be strongly NP-hard, a combination between an ant colony algorithm, a heuristic algorithm and a local search procedure is proposed and presented. The hybrid approach is to use artificial ants to construct soluti...
متن کاملScheduling of a hub reentrant job shop to minimize makespan
This paper focuses on a hub reentrant shop scheduling problem which is motivated by actual packing production line in the iron and steel industry. There are five operations for processing a job where three operations must be processed on a hub machine, and between any two consecutive operations on the hub machine, two operations must be processed on other two secondary machines, respectively. W...
متن کاملMinimizing Makespan for a Flexible Flow Shop Scheduling Problem in a Paint Company
This paper focuses on a Flexible Flow Shop (FFS) problem in a paint company in an attempt to minimize production makespan. The FFS problem is characterized by multiple products being produced in machines in stages with sequence dependent set up times and infinite intermediate storages. As the FFS problem is computationally complex, two heuristic methods are employed to solve the Mixed Integer L...
متن کاملInvestigation of the two-machine flow shop scheduling problem to minimize total energy costs with time-dependent energy prices
In this paper, the problem of two-machine flow shop scheduling to minimize total energy costs under time-of-use tariffs is investigated. As the objective function of this study is not a regular measure, allowing intentional idle-time can be advantageous. So this study considers two approaches, one for non-delay version of the problem and the other one for a situation when inserting intentional ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientia Iranica
سال: 2019
ISSN: 2345-3605
DOI: 10.24200/sci.2019.53600.3325